queue size
英 [kjuː saɪz]
美 [kjuː saɪz]
网络 队列大小; 队列长度
双语例句
- Set the work request queue size to equal the message consumption batch size of a monitor model or leave it empty.
将workrequestqueuesize的值设置为等于监视器模型的messageconsumptionbatchsize或设置为空。 - This queue type is similar to a concurrent blocking queue except that the size of the queue is bounded.
这种队列与并发阻塞队列相似，但是对队列的大小有限制。 - The non-persistent queue buffer size is specified using the tuning parameter DefaultQBufferSize.
非持久队列缓冲区使用名称为DefaultQBufferSize的优化参数指定。 - In the Work request queue size field, enter the value that you specified for the message consumption batch size of that monitor model.
在Workrequestqueuesize字段输入您为该监视器模型的messageconsumptionbatchsize指定的值。 - To view the queue size for the ent0 adapter, use following command
要查看ent0适配器的队列大小，可以使用以下命令 - During queue creation, the user must specify the maximum length of the queue and the maximum size of an individual message.
在创建队列时，用户必须指定队列的最大长度和一个消息的最大大小。 - The work request queue size parameter specifies the size of the work request queue, a buffer that holds scheduled work objects.
workrequestqueuesize参数指定工作请求队列的大小，这是一个容纳计划内工作对象的缓冲。 - For each active network adapter, the transmit queue ( tx_for Ethernet) and the receive queue size should be increased to their maximum value.
对于每个活动的网络适配器，传送队列（txforEthernet）和接收队列应该增加到它们的最大值。 - While the queue is unbound in size, enabling adds to return immediately, one cannot take an element from the queue until the delay time has expired.
因为队列的大小没有界限，使得添加可以立即返回，但是在延迟时间过去之前，不能从队列中取出元素。 - Random early detection ( RED) probabilistically drops datagrams early when the queue exceeds a configured size.
随机早期检测（红色）概率下降数据早期当队列超过了配置的大小。 - Linear RED is simple and easy to calculate; however, when average queue size is near to the minimum and maximum threshold, the loss rate is unreasonable.
线性RED算法虽然简单且容易计算，但队列位于最小阈值和最大阈值附近时的丢包概率都不太合理。 - It is always at least as large as the queue size.
它总是至少和队列大小是是一样大小的。 - After verifying the nonlinear character between average queue size and packet loss rate, an improved RED algorithm named JRED was presented.
在论证了平均队列长度和丢包概率间为非线性性质后，提出了一种改进非线性RED算法&JRED。 - Return the queue size.
传回队列的大小。 - Finally, by constructing a queue model, the paper computed the queue delay and analyzed the effect of the size of serving window on the data access delay ( DAD).
通过构建排队模型，计算排队延迟，分析了服务窗口大小对数据分组访问延迟的影响。 - Through calculating the average queue size, Random Early Detection ( RED) algorithm can drop packets with relevant probability, so congestion resulted from TCP flows can be avoided.
随机早检测算法通过计算TCP流的平均队列长度，进行适当的概率丢弃分组，从而有效地避免了由TCP流导致的网络拥塞。 - Therefore we use standard time delayed feedback control and extended time delayed feedback control approaches to control the system parameter in order to stabilize the chaotic behavior of average queue size of the system.
因此，我们使用标准时间延迟反馈控制和扩展时间延迟反馈控制方法来稳定系统平均队列长度的混沌行为。 - Simulations results prove that the new algorithm can provide stable average queue size, delay time and simplify parameters setting, in addition to the advantage of RIO algorithm, also can effectively improve the performance of AF service in Diffserv network.
仿真结果表明，该算法在保持了RIO算法优点的同时，还可以提供稳定的平均队列长度和延迟时间，同时可以简化参数的设置，从而有效地提高了区分服务网络中保证转发服务的性能。 - In the second case, we got the GFP of queue size, mean busy period, mean number of clients successfully serviced at station I, mean cyclic time, etc.
在穷尽服务情形，得出了队长母函数的递推公式、平均忙期、成功服务次数、平均周期等量。 - We discuss the structure of the imbedded Markov chain at arrival points, study the steady condition, and the steady queue size.
在休假时间服从负指数分布情况下，讨论了到达点嵌入Markov链的结构、平衡条件和稳态队长。 - It derives the bounds on queue size, delay and effective bandwidth by network calculus.
基于网络演算推导并建立了该系统框架下的队列长度、延迟/延迟抖动以及有效带宽等性能边界模型。 - A theoretical queue model of ATM switch with Bernoulli arrivals of two priorities and finite output buffer capacity is developed. The average queue size, the loss probability of packet and the average waiting time are derived.
对双优先级贝努利（Bernoulli）分布到达的有限输出队列ATM交换模型进行了理论分析，导出了平均队长、平均分组丢失率、平均分组等待时间等关系式。 - The Random Early Detection ( RED) mechanism for congestion avoidance helps keep the average queue size low, allows occasional packet bursts, and prevents global synchronization of source windows due to its randomness in marking or dropping packets at a congested node.
基于拥塞避免的早期自由检测（RED）机制能够帮助保持平均队列数目较低，允许偶尔的包冲突，可以通过对冲突节点的包做记号或将其丢弃来阻止全局同步的发生。 - The simulation results show that the mechanism proposed works well in terms of stability of the average queue size and system robustness.
结果显示，在所设计的单神经元自适应PID控制机制下，节点平均队列稳定性好且具有较好的鲁棒性。 - But RIO algorithm cannot stabilize the queue size and therefore, leads to unpredictable queuing delay and jitter.
但是RIO算法不能有效地保持队列长度的稳定性，因此会导致不可预测的排队延迟和延迟抖动，另外RIO算法还存在带宽偏移问题。 - In this paper, We studied algorithms of active queue management for DiffServ AF PHB and analyzed the difference of calculation for average queue size and drop probability with these algorithms, then discussed the ability to protect lower drop precedence traffic of WRED and RIO.
文章对区分服务中AFPHB的主动队列管理算法进行了研究，分析了几种算法在平均队长和丢弃概率计算上的差别，探讨了WRED和RIO算法对低丢弃优先级包的保护能力。 - The basic idea of RED is to monitor the average queue size to detect network congestion.
RED的基本思想是路由器通过监控队列的平均长度来探测拥塞。 - It is well known that the sensitivity to parameters of the RED algorithm leads to invalidation to queue size control with the variation of networks traffic, and even the frequent queue overflow and decreasing utilization of links.
但是由于RED算法对参数的敏感，导致其在网络流量发生变化时不能很好地控制队列长度，甚至会频繁产出现队列溢出，从而降低了链路利用率。 - Simulations are carried out to evaluate the loss differentiation algorithm under various network configurations including different number of competing flows, wireless loss rate, and queue buffer size.
通过仿真实验评估了该算法在网络条件（竞争流个数、无线差错率、路由器缓存大小）变化时丢失区分的效果。